Robust and Decentralized Task Assignment Algorithms for UAVs
نویسنده
چکیده
This thesis investigates the problem of decentralized task assignment for a fleet of UAVs. The main objectives of this work are to improve the robustness to noise and uncertainties in the environment and improve the scalability of standard centralized planning systems, which are typically not practical for large teams. The main contributions of the thesis are in three areas related to distributed planning: information consensus, decentralized conflict-free assignment, and robust assignment. Information sharing is a vital part of many decentralized planning algorithms. A previously proposed decentralized consensus algorithm uses the well-known Kalman filtering approach to develop the Kalman Consensus Algorithm (KCA), which incorporates the certainty of each agent about its information in the update procedure. It is shown in this thesis that although this algorithm converges for general form of network structures, the desired consensus value is only achieved for very special networks. We then present an extension of the KCA and show, with numerical examples and analytical proofs, that this new algorithm converges to the desired consensus value for very general communication networks. Two decentralized task assignment algorithms are presented that can be used to achieve a good performance for a wide range of communication networks. These include the Robust Decentralized Task Assignment (RDTA) algorithm, which is shown to be robust to inconsistency of information across the team and ensures that the resulting decentralized plan is conflict-free. A new auction-based task assignment algorithm is also developed to perform assignment in a completely decentralized manner where each UAV is only allowed to communicate with its neighboring UAVs, and there is no relaying of information. In this algorithm, only necessary information is communicated, which makes this method communication-efficient and well-suited for low bandwidth communication networks. The thesis also presents a technique that improves the robustness of the UAV task assignment algorithm to sensor noise and uncertainty about the environment. Previous work has demonstrated that an extended version of a simple robustness algorithm in the literature is as effective as more complex techniques, but significantly
منابع مشابه
Robust Decentralized Task Assignment for Cooperative UAVs
This paper investigates the problem of decentralized task assignment for a fleet of cooperative UAVs. It extends the analysis of a previously proposed algorithm to consider the performance with different communication network topologies. The results show that the second communication step introduced during the planning phase of the new algorithm is crucial for sparse networks because the conver...
متن کاملDecentralized Task Assignment for Multiple UAVs using Genetic Algorithm with Negotiation scheme approach
This paper deals with a task assignment problem of cooperative multiple Unmanned Aerial Vehicles (UAVs). The problem about assigning the tasks to each UAV can be interpreted as a combinatorial optimization problem such as Travelling Salesman Problem (TSP), Vehicle Routing Problem (VRP), and Generalized Assignment Problem (GAP). These problems have NP-complete computational complexity which has ...
متن کاملRobust Planning for Heterogeneous UAVs in Uncertain Environments
Future Unmanned Aerial Vehicle (UAV) missions will require the vehicles to exhibit a greater level of autonomy than is currently implemented. While UAVs have mainly been used in reconnaissance missions, future UAVs will have more sophisticated objectives, such as Suppression of Enemy Air Defense (SEAD) and coordinated strike missions. As the complexity of these objectives increases and higher l...
متن کاملConsensus-Based Decentralized Auctions for Robust Task Allocation Citation
This paper addresses task allocation to coordinate a fleet of autonomous vehicles by presenting two decentralized algorithms: the consensus-based auction algorithm (CBAA) and its generalization to the multi-assignment problem, i.e., the consensus-based bundle algorithm (CBBA). These algorithms utilize a market-based decision strategy as the mechanism for decentralized task selection and use a c...
متن کاملDecentralized Planning for Autonomous Agents Cooperating in Complex Missions
Planning for autonomous vehicles remains an important and challenging research topic. This thesis focuses on decentralized planning for autonomous agents performing complex missions. These types of missions often involve a set of tasks, each representing a component of the mission. Task planning algorithms may be used as part of the mission planner to assign agents to tasks; however, the decent...
متن کامل